A note on the Newton radius
نویسندگان
چکیده
The Newton radius of a code is the largest weight of a uniquely correctable error. We establish a lower bound for the Newton radius in terms of the rate. In particular we show that in any family of linear codes of rate below one half, the Newton radius increases linearly with the codeword length.
منابع مشابه
A note on the bounds of Laplacian-energy-like-invariant
The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...
متن کاملSolution of strongly nonlinear oscillator problem arising in Plasma Physics with Newton Harmonic Balance Method
In this paper, Newton Harmonic Balance Method (NHBM) is applied to obtain the analytical solution for an electron beam injected into a plasma tube where the magnetic field is cylindrical and increases towards the axis in inverse proportion to the radius. Periodic solution is analytically verified and consequently the relation between the Natural Frequency and the amplitude is obtained in an ana...
متن کاملOn the Newton and covering radii of linear codes
The Newton radius of a code is the largest weight of a uniquely correctable error. The covering radius is the largest distance between a vector and the code. Two relations between the Newton radius and the covering radius are given.
متن کاملA Novel Multimode Mobile Robot with Adaptable Wheel Geometry for Maneuverability Improvement
In this paper, an innovative mobile platform is presented which is equipped by three new wheels. The core of the new idea is to establish a new design of rigid circular structure which can be implemented as a wheel by variable radius. The structure of wheel includes a circular pattern of a simple two-link mechanism assembled to obtain a wheel shape. Each wheel has two degrees of freedom. The fi...
متن کاملA Trust Region Algorithm for Solving Nonlinear Equations (RESEARCH NOTE)
This paper presents a practical and efficient method to solve large-scale nonlinear equations. The global convergence of this new trust region algorithm is verified. The algorithm is then used to solve the nonlinear equations arising in an Expanded Lagrangian Function (ELF). Numerical results for the implementation of some large-scale problems indicate that the algorithm is efficient for these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012